github.com/andybalholm/brotli.hasherSearchResult.len (field)

30 uses

	github.com/andybalholm/brotli (current package)
		backward_references.go#L73: 		sr.len = 0
		backward_references.go#L85: 					sr2.len = brotli_min_size_t(sr.len-1, max_length)
		backward_references.go#L87: 					sr2.len = 0
		backward_references.go#L110: 			apply_random_heuristics = position + 2*sr.len + random_heuristics_window_size
		backward_references.go#L124: 				*commands = append(*commands, makeCommand(&params.dist, insert_length, sr.len, sr.len_code_delta, distance_code))
		backward_references.go#L135: 				var range_end uint = brotli_min_size_t(position+sr.len, store_end)
		backward_references.go#L136: 				if sr.distance < sr.len>>2 {
		backward_references.go#L137: 					range_start = brotli_min_size_t(range_end, brotli_max_size_t(range_start, position+sr.len-(sr.distance<<2)))
		backward_references.go#L143: 			position += sr.len
		h5.go#L120: 	var best_len uint = out.len
		h5.go#L124: 	out.len = 0
		h5.go#L159: 						out.len = best_len
		h5.go#L199: 						out.len = best_len
		h6.go#L122: 	var best_len uint = out.len
		h6.go#L126: 	out.len = 0
		h6.go#L161: 						out.len = best_len
		h6.go#L201: 						out.len = best_len
		hash.go#L39: 	len            uint
		hash.go#L154: 	out.len = matchlen
		hash_forgetful_chain.go#L163: 	var best_len uint = out.len
		hash_forgetful_chain.go#L167: 	out.len = 0
		hash_forgetful_chain.go#L196: 						out.len = best_len
		hash_forgetful_chain.go#L238: 						out.len = best_len
		hash_longest_match_quickly.go#L116: 	var best_len_in uint = out.len
		hash_longest_match_quickly.go#L136: 					out.len = uint(len)
		hash_longest_match_quickly.go#L171: 				out.len = uint(len)
		hash_longest_match_quickly.go#L200: 					out.len = best_len
		hash_rolling.go#L153: 					if len >= 4 && len > out.len {
		hash_rolling.go#L156: 							out.len = uint(len)